Data-parallel Micropolygon Rasterization
نویسندگان
چکیده
We implement a tile based sort-middle rasterizer in CUDA and study its performance characteristics when used as a backend for adaptive tessellation down to micropolygons. Tessellation and bucketing map very well to the data-parallel paradigm of CUDA, and the majority of time is spent with rasterization. Despite this, our fastest implementation is able to reach 30-50% of the hardware rasterization performance of an Nvidia GTX 280. Overall we are able to rasterize 4 M textured and Phong shaded microquads into a 1600x1200 framebuffer at 10-12 fps.
منابع مشابه
Evolving the Real-time Graphics Pipeline for Micropolygon Rendering a Dissertation Submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
The modern real-time graphics pipeline is a versatile parallel architecture that accommodates a wide range of rendering techniques. The architecture is implemented by heavily optimized graphics processors (GPUs) that employ a mixture of applicationprogrammable and fixed-function processing resources, yet its design lends itself to a simple programming model easily understood by non-expert progr...
متن کاملDirectX 11 Reyes Rendering
We map reyes-rendering to the GPU by leveraging new features of modern GPUs exposed by the Microsoft DirectX11 API. That is, we show how to accelerate reyes-quality rendering for realistic real-time graphics. In detail, we discuss the implementation of the split-and-dice phase via the Geometry Shader, including bounds on displacement mapping; micropolygon rendering without standard rasterizatio...
متن کاملAn Exact Weaving Rasterization Algorithm For Digital Planes
In this paper a new 3D plane rasterization algorithm based on weaving techniques is presented. This algorithm uses the coherence present in 3D parallel lines within the plane. Parallel lines have the same cyclic Freeman chain code but shifted by a parameter. This article provides the theory to determine this shift parameter.
متن کاملPolygon Rendering for Interactive Visualization on Multicomputers
This dissertation identifies a class of parallel polygon rendering algorithms suitable for interactive use on multicomputers, and presents a methodology for designing efficient algorithms within that class. The methodology was used to design a new polygon rendering algorithm that uses the frame-to-frame coherence of the screen image to evenly partition the rasterization at reasonable cost. An i...
متن کاملSpeeding Up Geospatial Polygon Rasterization on GPGPUs
This study targets at speeding up polygon rasterization in large-scale geospatial datasets by utilizing massively parallel General Purpose Graphics Processing Units (GPGPU) computing for efficient spatial indexing and analysis based on a dynamically integrated vector-raster data model. As the first step, we have designed and implemented a parallelization schema for moderately large polygons usi...
متن کامل